Balance constraints reduction of large-scale linear programming problems

This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation.     

一类求解线性约束非线性规划问题的可行方向法

Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。     

Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints

In this paper, we extend the classical convergence and rate of convergence results for the method of multipliers for equality constrained problems to general inequality constrained problems, without assuming the strict complementarity hypothesis at the local optimal solution. Instead, we consider an alternative second-order sufficient condition for a strict local minimum, which coincides with the standard one in the case of strict complementary slackness. As a consequence, new stopping rules are derived in order to guarantee a local linear rate of convergence for the method, even if the current Lagrangian is only asymptotically minimized in this more general setting. These extended results allow us to broaden the scope of applicability of the method of multipliers, in order to cover all those problems admitting loosely binding constraints at some optimal solution. This fact is not meaningless, since in practice this kind of problem seems to be more the rule rather than the exception.In proving the different results, we follow the classical primaldual approach to the method of multipliers, considering the approximate minimizers for the original augmented Lagrangian as the exact solutions for some adequate approximate augmented Lagrangian. In particular, we prove a general uniform continuity property concerning both their primal and their dual optimal solution set maps, a property that could be useful beyond the scope of this paper. This approach leads to very simple proofs of the preliminary results and to a straight-forward proof of the main results.The author gratefully acknowledges the referees for their helpful comments and remarks. This research was supported by FONDECYT (Fondo Nacional de Desarrollo Científico y Technológico de Chile).     

Determination of the portfolio selection for a property-liability insurance company

This paper presents an analysis of a portfolio model which can be used to assist a property-liability insurance company in determining the optimal composition of the insurance and investment portfolios. By introducing insurer's threshold risk and relaxing some non-realistic assumptions made in traditional chance constraint insurance and investment portfolio models, we propose a method for an insurer to maximize his return threshold for a given threshold risk level. This proposed model can be used to optimize the composition of underwriting and investment portfolios regarding the insurer's threshold risk level, as well as to generate the efficient frontier by adjusting insurer's threshold risk levels. A numerical example is given based on the industry's aggregated data for a sixteen year period.     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

具连续分布滞量的非线性中立型抛物偏泛函微分方程的振动性

考虑一类具连续分布滞量的非线性中立型抛物偏泛函微分方程解的振动性,借助Green定理和时滞微分不等式获得了这类方程在Robin,Dirichlet边值条件下所有解振动的若干充分条件.     

基于几何不变量的蛋白质三维分子结构比对

为了解决蛋白质三维结构比对需要处理大量的旋转、平移变换，直接用动态规划将变得十分繁琐这一问题，在保留蛋白质空间结构属性特征的基础上，对蛋白质三维数据进行了预先的处理．通过计算蛋白质结构在旋转和平移下的几何不变量，将蛋白质的三维结构坐标变换为具有旋转、平移不变性的一维序列．进一步给出了“距离”以及“相似得分”的定义．在此基础上采用动态规划方法给出了新的蛋白质结构比对算法．对专家分类的蛋白质结构数据库进行测试，结果显示准确、快速．     

A constructive characterization of the split closure of a mixed integer linear program

Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel.     

The uv-Decomposition on a Class of D.C. Functions and Optimality Conditions

In this paper,the UV-theory and P-differential calculus are employed to study second-order ex-pansion of a class of D.C.functions and minimization problems.Under certain conditions,some properties ofthe U-Lagrangian,the second-order expansion of this class of functions along some trajectories are formulated.Some first and second order optimality conditions for the class of D.C.optimization problems are given.     

SUN5500小型机MPI编程与蕴式并行计算的实现方法

基于SUN5500小型计算机并行开发环境，给出了消息传递模型和蕴式行模型的实现方法，通过实例分析了SUNMPI实际编程，并对选取不同模型有不同参数的运算时间进行了比较，结果表明，在SUN5500计算机上MPI模型和蕴式并行模型均能较大地提高运算速度，而且MPI在灵活性和并行程度方面更优。